General frame constructions for Z-cyclic triplewhist tournaments
نویسندگان
چکیده
منابع مشابه
An existence theorem for cyclic triplewhist tournaments
We show that a Z-cyclic triplewhist tournament TWh(v) exists whenever v =p] . . . . p~ where the primes p~ are -5(mod8) , p~>29. The method of construction uses the existence of a primitive root ~o of each such Pi (~61) such that ~o2+eo+ 1 are both squares (modpi).
متن کاملZ-cyclic whist tournaments for q players
Expanding upon a comment by P. A. Leonard (1996, Utilitas Math. 49, 223-232), we exhibit Z-cyclic patterned-starter based whist tournaments for q2 players, where q = 4k+3 is prime; the cases 3 < q < 200 are included herein, with data for 200 < q < 3,500 available electronically.
متن کاملA new construction for Z-cyclic whist tournaments
In this paper, a new construction for Z-cyclic whist tournaments is given. The known existence results for both Z-cyclic whist tournaments and Z-cyclic triplewhist tournaments are extended. ? 2003 Elsevier B.V. All rights reserved.
متن کاملConstructions over Tournaments
We investigate tournaments that are projective in the variety that they generate, and free algebras over partial tournaments in that variety. We prove that the variety determined by three-variable equations of tournaments is not locally finite. We also construct infinitely many finite, pairwise incomparable simple tournaments.
متن کاملBounds and constructions for n-e.c. tournaments
Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive n-e.c. tournaments by considering circulant tournaments. Switching is used to generate new ne.c. tournaments of certain orders. With aid of a computer search, we demonstrate that there is a unique minimum order 3-e.c. tournamen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2007
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2006.08.011